Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
نویسندگان
چکیده
منابع مشابه
Joint Degree Distributions of Preferential Attachment Random Graphs
We study the joint degree counts in linear preferential attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p and also provide optimal rates of convergence of the finite dimensional distributions. The results hold for models with any general initial seed grap...
متن کاملPartitioning Random Graphs with General Degree Distributions
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) from a random graph. During the last 30 years many algorithms for this problem have been developed that work provably well on models resembling the Erdős-Rényi model Gn,m. Since in these random graph models edges are distributed very uniformly, the recent theory of large networks provides convinci...
متن کاملDirected Random Graphs with Given Degree Distributions
Abstract: Given two distributions F and G on the nonnegative integers we propose an algorithm to construct inand out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that is, from which a simple directed graph can be drawn. We then analyze a directed version of the configuration model and show that, provided that F an...
متن کاملDegree Distributions in General Random Intersection Graphs
Random intersection graphs, denoted by G(n,m, p), are introduced in [9, 14] as opposed to classical Erdős-Rényi random graphs. Let us consider a set V with n vertices and another universal set W with m elements. Define a bipartite graph B(n,m, p) with independent vertex sets V and W . Edges between v ∈ V and w ∈ W exist independently with probability p. The random intersection graph G(n,m, p) d...
متن کاملDesign of Irregular Repeat Accumulate Codes with Joint Degree Distributions
Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2008
ISSN: 0916-8508,1745-1337
DOI: 10.1093/ietfec/e91-a.10.2737